Quantum Public-Key Cryptosystem Using Non-orthogonal States
نویسندگان
چکیده
In this paper we provide a quantum public-key cryptosystem using non-orthogonal states. A user Alice uses a set of particles which are in non-orthogonal quantum states as the public key kept by a key management center (KMC) while she keeps the states of the particles secret as the private key. By the help of KMC any other user can send encrypted message to Alice. Any one including KMC except Alice can’t get the message. On the other hand digital signature can also be achieved by this public-key cryptosystem. There are no entangled states and complex operations needed in our cryptosystem. So it’s easier to carry out in practice and more robust against possible attacks.
منابع مشابه
Deterministic secure communication protocol
Quantum key distribution (QKD) is a protocol which is provably secure, by which private key bit can be created between two parties over a public channel. The key bits can then be used to implement a classical private key cryptosystem, to enable the parties to communicate securely. The basic idea behind QKD is that Eve cannot gain any information from the qubits transmitted from Alice to Bob wit...
متن کاملQTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کاملLong Distance Quantum Key Distribution without Quantum Memory
A quantum cryptography scheme for lossy channel is proposed which does not employ quantum memory. The scheme also does not use quantum codes and is rather simple for practical implementation. The goal of quantum cryptography is to secretly distribute the key (a string of bits) between the two spatially separated legitimate users. The existing quantum cryptography schemes can be classified into ...
متن کاملEEH: AGGH-like public key cryptosystem over the eisenstein integers using polynomial representations
GGH class of public-key cryptosystems relies on computational problems based on the closest vector problem (CVP) in lattices for their security. The subject of lattice based cryptography is very active and there have recently been new ideas that revolutionized the field. We present EEH, a GGH-Like public key cryptosystem based on the Eisenstein integers Z [ζ3] where ζ3 is a primitive...
متن کامل0 A Simple Proof of the Unconditional Security of Relativistic Quantum Cryptography
A simple proof of the unconditional security of a relativistic quantum cryptosystem based on orthogonal states is proposed. Restrictions imposed by special relativity allow to substantially simplify the proof compared with the non-relativistic cryptosystems involving non-orthogonal states. Important for the proposed protocol is the spatio-temporal structure of the quantum states which is actual...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- JSW
دوره 8 شماره
صفحات -
تاریخ انتشار 2013